Two Proofs for Shallow Packings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Proofs for Shallow Packings

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let V be a finite set system defined over an n-point set X; we view V as a set of indicator vectors over the n-dimensional unit cube. A δ-separated set of V is a subcollection W, s.t. the Hamming distance between each pair u,v ∈W is greater than δ, where δ > 0 is an integer ...

متن کامل

Shallow Packings in Geometry

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let V be a finite set system defined over an n-point set X; we view V as a set of indicator vectors over the n-dimensional unit cube. A δ-separated set of V is a subcollection W, s.t. the Hamming distance between each pair u,v ∈ W is greater than δ, where δ > 0 is an integer...

متن کامل

Shallow Lazy Proofs

We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.

متن کامل

Kissing numbers, sphere packings, and some unexpected proofs

The “kissing number problem” asks for the maximal number of white spheres that can touch a black sphere of the same size in n-dimensional space. The answers in dimensions one, two and three are classical, but the answers in dimensions eight and twenty-four were a big surprise in 1979, based on an extremely elegant method initiated by Philippe Delsarte in the early seventies, which concerns ineq...

متن کامل

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning

The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if every pair of sets in R have large symmetric difference, then R cannot contain too many sets. Recently it was generalized to the shallow packing lemma, applying to set systems as a function of their shallow-cell complexity. In this paper we present several new results and applications related to pac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2016

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-016-9824-0